On the Vacationing CEO Problem: Achievable Rates and Outer Bounds
نویسندگان
چکیده
This paper studies a class of source coding problems that combines elements of the CEO problem with the multiple description problem. In this setting, noisy versions of one remote source are observed by two nodes with encoders (which is similar to the CEO problem). However, it differs from the CEO problem in that each node must generate multiple descriptions of the source. This problem is of interest in multiple scenarios in efficient communication over networks. In this paper, an achievable region and an outer bound are presented for this problem, which is shown to be sum rate optimal for a class of distortion constraints.
منابع مشابه
On the Capacity of the 2-User Interference Channel with Transmitter Cooperation and Secrecy Constraints
This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user’s d...
متن کاملBounds on the outer-independent double Italian domination number
An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is cal...
متن کاملDistributed MIMO receiver - Achievable rates and upper bounds
In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex Gaussian noise. In the nomadic regime, we assume that the agents do not have any decoding ability. These agents process their channel observations and forward the...
متن کاملThe Region of Achievable Rates for Multiterminal Source Coding–Part I
It is proved that a convexified form of the Berger-Tung inner bound provides the set of all achievable rates for the multiterminal source coding problem. In this paper, a proof is developed for general discrete memoryless sources and bounded distortion measures, for two encoding terminals. The proof is based on two new developments. One is the construction of new inner and outer bounds to the r...
متن کاملA Note on Cooperative Multiterminal Source Coding
We consider the multiterminal source coding problem with partially cooperating encoders. In the lossless case, we give a simple proof for a coding theorem that extends the result of Slepian and Wolf for non-cooperating encoders, resulting in a complete characterization of the rate region under this scenario. Then we extend this setup to consider an arbitrary pair of distortions (D1, D2), where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1001.0793 شماره
صفحات -
تاریخ انتشار 2010